Forming Buyer Coalition with Bundles of Items by Ant Colony Optimization
نویسنده
چکیده
The study of the buyer coalition has been reviewed by researchers for decades. However, there are few schemes applying ant colony optimization (ACO) for forming buyer coalition. In this paper, the approach called the Ant Colony for Buyer Coalition (ACBC) algorithm is proposed to form the buyer coalition with bundles of items. The main endeavor of the algorithm is to partition the whole group of buyers into smaller groups in order to achieve a common goal. The artificial ants search to find best disjoint subgroups of all buyers based on the total utility functions. The experimental results are compared with the genetic algorithm (GAs) in the terms of the global optimal solution. It indicates that the algorithm can improve the total discount of the buyer coalition. Key-Words: ant colony optimization; coalition structure; group formation.
منابع مشابه
Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملPreference Coalition Formation Scheme for Buyer Coalition Services with Bundles of Items
Coalition stability is a major requirement in coalition formation. One important problem to achieve stability in n-person game theories is the assumption that the preference of each buyer is publicly known. The coalition is said to be stable if there are no objection by any subset of buyers according to their publicly known preferences. However, such assumption is often unrealistic in typical r...
متن کاملA fuzzy vendor managed inventory of multi-item economic order quantity model under shortage: An ant colony optimization algorithm
In this study, a multi-item economic order quantity model with shortage under vendor managed inventory policy in a single vendor single buyer supply chain is developed. This model explicitly includes warehouse capacity and delivery constraints, bounds order quantity, and limits the number of pallets. Not only the demands are considered imprecise, but also resources such as available storage and...
متن کاملNew Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem
Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...
متن کاملSolving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization
One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...
متن کامل